Perfect matchings in r-partite r-graphs
نویسندگان
چکیده
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H , each satisfying the following condition: the degree of each legal r−1-tuple contained in the complement of this side is strictly larger than n 2 . We prove that under this condition H must have a perfect matching. This answers a question of Kühn and Osthus.
منابع مشابه
Unmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملMatchings and Tilings in Hypergraphs
We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of graph (k = 2) matchings, we determine the partite minimum codegree threshold for matchings with at most one vertex left in each part, thereby answering a problem asked by Rödl and Ruciński. We further improve the partite minimum codegree conditions to sum of all k par...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملPerfect Fractional Matchings in $k$-Out Hypergraphs
Extending the notion of (random) k-out graphs, we consider when the k-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each r there is a k = k(r) such that the k-out r-uniform hypergraph on n vertices has a perfect fractional matching with high probability (i.e., with probability tending to 1 as n → ∞) and prove an analogous result for r-uniform r-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009